Power series approximations for two-class generalized processor sharing systems
نویسندگان
چکیده
منابع مشابه
Power series approximations for two-class generalized processor sharing systems
We develop power series approximations for a discrete-time queueing system with two parallel queues and one processor. If both queues are non-empty, a customer of queue 1 is served with probability β and a customer of queue 2 is served with probability 1 − β. If one of the queues is empty, a customer of the other queue is served with probability 1. We first describe the generating functionU(z1,...
متن کاملOn Bivariate Generalized Exponential-Power Series Class of Distributions
In this paper, we introduce a new class of bivariate distributions by compounding the bivariate generalized exponential and power-series distributions. This new class contains the bivariate generalized exponential-Poisson, bivariate generalized exponential-logarithmic, bivariate generalized exponential-binomial and bivariate generalized exponential-negative binomial distributions as specia...
متن کاملFluid approximations for a processor-sharing queue
This paper studies the uid approximation, also known as the functional strong law-of-large-numbers, for a GI/G/1 queue under a processor-sharing service discipline. The uid (approximation) limit in general depends on the service time distribution, and the convergence is in general in the Skorohod J 1 topology. This is in contrast to the known result for the GI/G/1 queue under a FIFO service dis...
متن کاملWaiting times for M / M systems under generalized processor sharing
We consider a system where the arrivals form a Poisson process and the required service times of the requests are exponentially distributed. According to the generalized processor sharing discipline, each request in the system receives a fraction of the capacity of one processor which depends on the actual number of requests in the system. We derive systems of ordinary differential equations fo...
متن کاملAnalysis of Generalized Processor Sharing Systems Using Matrix Analytic Methods
| Generalized Processor Sharing (GPS) is an important scheduling discipline because it enables bandwidth sharing with work conservation and traÆc isolation properties. Although Markov Modulated Fluid Processes (MMFP) captures the ne dynamics of the sources and is expected to give tight performance bounds, the analysis of MMFP sources with a GPS server is usually diÆcult because of the large sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2010
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-010-9188-8